منابع مشابه
A Study of Flow and Mixing in Bubbly Gas-Liquid Pipe Flow Generated by a Grid
The spreading of a tracer in a bubbly two-phase grid-generated turbulent flow system is studied. In this work both particle image velocimetry (PIV) and planer laser-induced <span style="font-size: 10pt...
متن کاملStability of mixing and rapid mixing for hyperbolic flows
We obtain general results on the stability of mixing and rapid mixing (superpolynomial decay of correlations) for hyperbolic flows. Amongst Cr Axiom A flows, r ≥ 2, we show that there is a C2-open, Cr-dense set of flows for which each nontrivial hyperbolic basic set is rapid mixing. This is the first general result on the stability of rapid mixing (or even mixing) for Axiom A flows that holds i...
متن کاملNoise-Induced Stability Analysis of a Capillary Flow Microreactor with Mixing by Radial Diffusion of Laminar Flow Profiles
To overcome the problem of fluid mixing in capillary tubes, the induction of radial diffusion of laminar flow profiles (RDLFP) was proposed recently, together with a mathematical. Since, under realistic conditions, continuous flow capillary reactors are influenced by noise in the feed streams, the stability of such a reactor for a system of three liquids was analyzed through its largest Lyapuno...
متن کاملStability Bounds for Stationary phi-mixing and beta-mixing Processes
Most generalization bounds in learning theory are based on some measure of the complexity of the hypothesis class used, independently of any algorithm. In contrast, the notion of algorithmic stability can be used to derive tight generalization bounds that are tailored to specific learning algorithms by exploiting their particular properties. However, as in much of learning theory, existing stab...
متن کاملStability Bounds for Stationary φ-mixing and β-mixing Processes
Most generalization bounds in learning theory are based on some measure of the complexity of the hypothesis class used, independently of any algorithm. In contrast, the notion of algorithmic stability can be used to derive tight generalization bounds that are tailored to specific learning algorithms by exploiting their particular properties. However, as in much of learning theory, existing stab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sadhana
سال: 1988
ISSN: 0256-2499,0973-7677
DOI: 10.1007/bf02812201